Index Con gurations in Object - Oriented Databases

Several indexing techniques have been proposed to accelerate database operations in object-oriented databases. A database operation gives rise to the processing of a path. We address the problem of optimal index connguration for a given logical schema, the workload deened on the schema and some other database characteristics such as the cardinality of a class, page size, etc. As will be shown an optimal index connguration for the workload can be achieved by splitting the paths into subpaths and by indexing each subpath optimal. For the moment we take a limited number of existing indexing techniques into account (simple index, inherited index, nested inherited-index, multi-index, and multi-inherited index) and the possibility of not indexing a (sub)path. However, the principles of the algorithm will remain the same adding more indexing techniques.